Pasting quantum codes
نویسنده
چکیده
I describe a method for pasting together certain quantum error-correcting codes that correct one error to make a single larger one-error quantum code. I show how to construct codes encoding 7 qubits in 13 qubits using the method, as well as 15 qubits in 21 qubits and all the other “perfect” codes. 03.65.Bz,89.80.+h Typeset using REVTEX [email protected] 1 Quantum computers have a great deal of promise, but they are likely to be inherently much noisier than classical computers. One approach to dealing with noise and decoherence in quantum computers and quantum communications is to encode the data using a quantum error-correcting code. A number of such codes and classes of codes are known [1–8]. However, the only known method of automatically generating such codes is to find a suitable classical error-correcting code and convert it into a quantum code [2,3]. This method is limited to producing less efficient codes (i.e., with smaller ratio of encoded qubits to total qubits) than dedicated quantum codes, so a method of automatically producing highly efficient quantum codes is desirable. I will present here a method to create one-error quantum codes from smaller ones with almost no effort. The conditions for a set of n-qubit states |ψ1〉, . . . , |ψ2k〉 to form an error-correcting code for the errors Ea is 〈ψi|E † aEb|ψj〉 = Cabδij , (1) where Cab is independent of i and j [5,9]. A code with 2 k states encodes k qubits. Typically, a code will be designed to correct all possible errors affecting less than or equal to t qubits. The basis errors Ea are usually tensor products of I =
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملRandom Photon Key Pasting (RPKP) for Secure Optical Data Transport in Quantum Key Distribution
In this paper we proposed a new mutually authenticated method, ie Random Photon Key Pasting (RPKP) for secure data transmission which is already running under Quantum key distribution. RPKP is method which is trying to paste randomly generated number to the private key as log form and invoked from a trusted third party. The random numb will be completely based on the System level and it is high...
متن کاملPartition logics of automata
We introduce a new type of orthomodular poset which is obtained by considering the pasting of partitions of a set. These partition logics appear in the experimental investigation of finite automata and can be related to certain quantum mechanical systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996